matrix n. (pl. matrices 或matrixes) 1.【解剖学】子宫;母体;发源地,策源地,摇篮;【生物学】衬质细胞;间质;基质;母质。 2. 【矿物】母岩;脉石;【冶金】基体;【地质学;地理学】脉石;填质;杂矿石。 3. 【印刷】字模;型版,纸型;铸型,阴模。 4.【阵】(矩)阵,方阵;母式;【物理学】间架;【无线电】矩阵变换电路。 5.【染】原色〔红黄蓝白黑五种〕。 the matrix of a nail 【解剖学】指甲床。
Returns the matrix transpose of a given matrix 返回一个给定矩阵的转置矩阵。
Matrix object that is the matrix transpose of the matrix 对象,该对象是此矩阵的转置矩阵。
The results indicate that the serial and parallel optimization for fft , phase compensation and matrix transpose has the most significance for sar imaging performance 分析结果认为,对sar成像处理的优化,主要是对fft 、相位补偿运算和矩阵转角运算等3类典型运算的串行优化和并行优化。
The fast dct algorithm not only can reduce the multiplication number , but also can combine the post - scaling and matrix transpose needed for fast dct with the quantization and scan processes , so as to speed up the whole mpeg encoder . in addition , the table - lookup fast quantization algorithm can further speed up the encoding process 本章提出的快速dct算法不仅减少了所需乘法的次数,而且变换后的后置乘法和矩阵转置过程可与量化和扫描相结合,进一步加速浙江大学博士学位论文整个mpeg编码过程。
Also , the relactions between the best block size for matrix transpose and the size and associativity of the processor ' s cache is formulized . for parallel optimization , several programming models available on a numa system , such as lightweight processes ( sproc ) , posix threads , openmp and mpi , are compared , and their speedup and coding complexity are analyzed 对于sar成像处理的并行优化,本文对比了在numa架构上可用的几种并行编程模型:轻量级进程、 posix线程、 openmp和mpi ,针对numa架构和sar成像处理的特点从加速比、编程复杂度等多个方面进行了讨论。
Chapter 2 analyzes parallel process technology ' s actuality , the requirement of real - time process , and mostly guidelines of parallel process performance . chapter 3 discusses imaging algorithm - - - - - - chirp scaling algorithm theory as well as realization of ideal point target ; and then discuss the scalar of data and operation . chapter 4 discuss the fft and distributed matrix transposing , mostly about ( 1 ) discussed how to realize parallel fft , and evaluate the preformance of parallel fft ; ( 2 ) discuss another step ' s - - - - - - matrix transposing - - - - - - realization can divided into three steps : distributing , renewedly distributing and local transposing of matrix , and then discuss the time of process in detail 第四章分别研究了cs算法中的fft变换和分布式矩阵的转置问题,主要有: ( 1 )对cs算法中运算量最大的步骤fft变换进行了并行性的提取,并对并行fft变换的算法性能进行了评估; ( 2 )分析并研究了cs算法中另一不可或缺的步骤? ?矩阵转置问题,提出矩阵分布、重新分布和局部转置来实现矩阵转置的并行化,并详细分析了矩阵转置的时间耗费问题。